Stochastic Programs with Recourse
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Convex approximations for stochastic programs with simple integer recourse
We review convex approximations for stochastic programs with simple integer recourse. Both for the case of discrete and continuous random variables such approximations are discussed, and representations as continuous simple recourse problems are given.
متن کاملStochastic Programming with Simple Integer Recourse
Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs. Analytical as well as computational properties of the expected recourse funct...
متن کاملA Survey and Comparison of Optimization Methods for Solving Multi-Stage Stochastic Programs with Recourse
In the last decade, multi-stage stochastic programs with recourse have been broadly used to model real-world applications. This paper reviews the main optimization methods that are used to solve multi-stage stochastic programs with recourse. In particular, this paper reviews four types of optimization approaches to solve multi-stage stochastic programs with recourse: direct methods, decompositi...
متن کاملAn Adaptive Approximation Method for Stochastic, Dynamic Programs, with Applications to Inventory and Distribution Problems
We introduce a technique called Concave, Adaptive Value Estimation (CAVE) to approximate recourse functions found in stochastic programs. CAVE constructs a sequence of concave (or convex) piecewise-linear approximations using sample gradients of the recourse function at di erent points in the domain. The result is a nonlinear approximation that is more responsive than traditional stochastic qua...
متن کاملAn Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
We study an adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. A partition-based formulation is a relaxation of the original stochastic program, and we study a finitely converging algorithm in which the partition is adaptively adjusted until it yields an optimal solution. A solution guided refinement strategy is developed to refine the partition by ...
متن کاملLipschitz Stability for Stochastic Programs with Complete Recourse
This paper investigates the stability of optimal solution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures.piro proved Lipschitz upper semicontinuity of the solution set mapping. Inspired by this result, we introduce a subgradient distance for probability distributions and esta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010